Asymmetry and structural information in preferential attachment graphs
نویسندگان
چکیده
منابع مشابه
Asymmetry and Structural Information in Preferential Attachment Graphs∗
Symmetries of graphs intervene in diverse applications, ranging from enumeration to graph structure compression, to the discovery of graph dynamics (e.g., inference of the arrival order of nodes in a growing network). It has been known for some time that ErdősRényi graphs are asymmetric with high probability, but it is also known that real world graphs (web, biological networks) have a signific...
متن کاملNongrowing Preferential Attachment Random Graphs
We consider an edge rewiring process which is widely used to model the dynamics of scale-free weblike networks. This process uses preferential attachment and operates on sparse multigraphs with n vertices and m edges. We prove that its mixing time is optimal and develop a framework which simplifies the calculation of graph properties in the steady state. The applicability of this framework is d...
متن کاملPreferential Attachment in Graphs with Affinities
Here, we give a full proof of Theorem 1. Recall that an equivalent construction of the PAGA graphs is obtained by collapsing the graph G 1 to G t m leading to t super nodes. Accordingly, based on G t m, we can directly generate G m by (temporarily) adding m more nodes, each linking with a single edge, and then collapsing these m nodes to the (t+ 1)th super node. Let dt,i(v) denote the degree of...
متن کاملAsynchronous Rumor Spreading in Preferential Attachment Graphs
We show that the asynchronous push-pull protocol spreads rumors in preferential attachment graphs (as defined by Barabási and Albert) in time O( √ logn) to all but a lower order fraction of the nodes with high probability. This is significantly faster than what synchronized protocols can achieve; an obvious lower bound for these is the average distance, which is known to be Θ(logn/ log log n).
متن کاملLocal Majority Dynamics on Preferential Attachment Graphs
Suppose in a graph G vertices can be either red or blue. Let k be odd. At each time step, each vertex v in G polls k random neighbours and takes the majority colour. If it doesn’t have k neighbours, it simply polls all of them, or all less one if the degree of v is even. We study this protocol on the preferential attachment model of Albert and Barabási [3], which gives rise to a degree distribu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2019
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20842